Laurier Flow

© 2024 LaurierFlow. All rights reserved.

AboutPrivacy

CP 312

Algorithm Design/Analysis I

100%Liked

Easy

60%

Useful

100%

1 ratings

Analysis of the best, average and worst-case behaviors of algorithms. Algorithmic strategies: brute force algorithms, greedy algorithms, divide-and-conquer, branch and bound, backtracking. Fundamental computing algorithms: O(n log n) sorting, hash table, binary trees, depth- and breadth-first search of graphs. Prerequisites: CP264 (or CP114 and CP213) and (CP214 or MA238).

Analysis of the best, average and worst-case behaviors of algorithms. Algorithmic strategies: brute force algorithms, greedy algorithms, divide-and-conquer, branch and bound, backtracking. Fundamental computing algorithms: O(n log n) sorting, hash table, binary trees, depth- and breadth-first search of graphs. Prerequisites: CP264 (or CP114 and CP213) and (CP214 or MA238).

100%Liked

Easy

60%

Useful

100%

1 ratings

Analysis of the best, average and worst-case behaviors of algorithms. Algorithmic strategies: brute force algorithms, greedy algorithms, divide-and-conquer, branch and bound, backtracking. Fundamental computing algorithms: O(n log n) sorting, hash table, binary trees, depth- and breadth-first search of graphs. Prerequisites: CP264 (or CP114 and CP213) and (CP214 or MA238).

CP 312

Algorithm Design/Analysis I

100%Liked

Easy

60%

Useful

100%

1 ratings

Analysis of the best, average and worst-case behaviors of algorithms. Algorithmic strategies: brute force algorithms, greedy algorithms, divide-and-conquer, branch and bound, backtracking. Fundamental computing algorithms: O(n log n) sorting, hash table, binary trees, depth- and breadth-first search of graphs. Prerequisites: CP264 (or CP114 and CP213) and (CP214 or MA238).

Analysis of the best, average and worst-case behaviors of algorithms. Algorithmic strategies: brute force algorithms, greedy algorithms, divide-and-conquer, branch and bound, backtracking. Fundamental computing algorithms: O(n log n) sorting, hash table, binary trees, depth- and breadth-first search of graphs. Prerequisites: CP264 (or CP114 and CP213) and (CP214 or MA238).

100%Liked

Easy

60%

Useful

100%

1 ratings

Analysis of the best, average and worst-case behaviors of algorithms. Algorithmic strategies: brute force algorithms, greedy algorithms, divide-and-conquer, branch and bound, backtracking. Fundamental computing algorithms: O(n log n) sorting, hash table, binary trees, depth- and breadth-first search of graphs. Prerequisites: CP264 (or CP114 and CP213) and (CP214 or MA238).

Course Reviews

Super useful course, it can be hard to wrap your brain around some concepts, but just watch a lot of videos on it!

Easy

Useful

Liked

— Business Administration (BBA) + Computer Science (BSc) student, taught by Nakhat Fatima

CP 312 Prerequisites

CP 264 (Min. Grade D-) or (CP 114 (Min. Grade D-) and CP 213 (Min. Grade D-) ) and (CP 214 (Min. Grade D-) or MA 238 (Min. Grade D-) )

CP 312 Leads To

CP 322, CP 414, CP 421

CP 312 Restrictions

Must be enrolled in one of the following Levels:

Undergraduate (UG)

Must be enrolled in one of the following Majors:

Computer Science (CPSC)

Data Science (DASC)

Course Schedule